On Parallel Generation of Combinations in Associative Processor Architectures
نویسنده
چکیده
In this paper two new parallel algorithms are presented for generation of (n,k)-combinations. Computations run in associative processor models. Objects are generated in lexicographic order, with O(1) time per object, in two di erent representations. The rst algorithm uses the conventional representation of combinations while the second algorithm generates combinations in the form of binary vectors and therefore is particularly well suited for row/columnmasks generation in associative processors. The algorithms may be also used for generation of related combinatorial objects like combinations with repetitions and integer compo-
منابع مشابه
On Parallel Generation of Set Partitions in Associative Processor Architectures
In this paper a new parallel algorithm is presented for generation of all m{block partitions of n{element set, 1 m n. Computations run in an associative processor model. Objects are generated in lexicographic order, with O(1) time per object. The algorithm is well suited for column/masks generation in associative processors.
متن کاملUltra-Low-Energy DSP Processor Design for Many-Core Parallel Applications
Background and Objectives: Digital signal processors are widely used in energy constrained applications in which battery lifetime is a critical concern. Accordingly, designing ultra-low-energy processors is a major concern. In this work and in the first step, we propose a sub-threshold DSP processor. Methods: As our baseline architecture, we use a modified version of an existing ultra-low-power...
متن کاملOn Parallel Generation of t-Ary Trees in an Associative Model
In this paper a new parallel algorithm is presented for generation of t–ary trees. Computations run in an associative processor model. Tree sequences are generated in lexicographic order, with O(1) time per object, in a new representation, as combinations with repetitions with restricted growth. The corresponding full t–ary trees (x–sequences) appear in antilexicographic order.
متن کاملA Scalable Pipelined Associative SIMD Array with Reconfigurable PE Interconnection Network for Embedded Applications
This paper describes the FPGA implementation of a specialized SIMD processor array for embedded applications. An alternative to traditional SoC or MPSoC architectures, this array combines the massive parallelism inherent in SIMD architectures with the search capabilities of associative computing, producing a SIMD Processor Array System on a Chip (PASoC) well suited for applications such as data...
متن کاملParallel Programming Models for Dense Linear Algebra on Heterogeneous Systems
We present a review of the current best practices in parallel programming models for dense linear algebra (DLA) on heterogeneous architectures. We consider multicore CPUs, stand alone manycore coprocessors, GPUs, and combinations of these. Of interest is the evolution of the programming models for DLA libraries – in particular, the evolution from the popular LAPACK and ScaLAPACK libraries to th...
متن کامل